Polynomial Arithmetic 3
ثبت نشده
چکیده
(1) Many typos have been corrected (2) Some redoundancy has been eliminated Notes on polynomially bounded arithmetic Abstract We characterize the collapse of Buss' bounded arithmetic in terms of the prov-able collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.
منابع مشابه
A Dichotomy Theorem for Homomorphism Polynomials
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H . We show that this family is computable by arithmetic circuits in constant depth if H has a loop or no edge and that it is hard otherwise (i.e., complete for VNP, the arithmetic class related to #P ). We...
متن کاملFast Library for Number Theory: An Introduction
We discuss FLINT (Fast Library for Number Theory), a library to support computations in number theory, including highly optimised routines for polynomial arithmetic and linear algebra in exact rings.
متن کاملOn Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant
We consider the problem of fixed-polynomial lower bounds on the size of arithmetic circuits computing uniform families of polynomials. Assuming the generalised Riemann hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in MA having no arithmetic circuits of size O(n) over C (allowing any complex constant). We also build a family of polynomials that can be evalua...
متن کاملA Survey of Satisfiability Modulo Theory
Satisfiability modulo theory (SMT) consists in testing the satisfiability of first-order formulas over linear integer or real arithmetic, or other theories. In this survey, we explain the combination of propositional satisfiability and decision procedures for conjunctions known as DPLL(T), and the alternative “natural domain” approaches. We also cover quantifiers, Craig interpolants, polynomial...
متن کاملLearning Restricted Models of Arithmetic Circuits
We present a polynomial time algorithm for learning a large class of algebraic models of computation. We show that any arithmetic circuit whose partial derivatives induce a low-dimensional vector space is exactly learnable from membership and equivalence queries. As a consequence, we obtain polynomial-time algorithms for learning restricted algebraic branching programs as well as noncommutative...
متن کامل